Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

目标信息的时效性分析

战场态势是随时间不断变化的,描述战场实体状态的目标信息有其寿命周期,须及时生成并提供给使用者.提出信息价值和信息时效性的概念来衡量指挥自动化系统提供的目标信息是否满足作战行动对时间的要求.信息价值因为延时而衰减,从而降低使用信息所能达到的效果.通过分析信息延时对决策质量、毁伤概率的影响,分别讨论了信息用于决策和作战的时效性.     

论化学灾害事故处置的指挥决策及其实施

化学灾害事故处置的指挥决策及其实施水平尤为重要,在分析当前指挥决策存在不足的基础上,从完善指挥决策组织、拓展依据、突出决策重点、加强人员装备,以及科学处理一些关系等方面进行了探讨。     

基于熵理论的战场情报评估方法

熵是度量信息有效性和可靠性的重要理论工具,分析了信息熵和条件熵,并深入研究了熵作为不确定性的度量在战场情报中的评估应用,最后举例说明了既要考虑信息的价值又要考虑其风险程度这一新的情报分析方法,使得决策过程透明化,降低了决策的风险。     

Optimal maintenance policies for a safety‐critical system and its deteriorating sensor

We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017     

基于核与灰度的区间灰数多属性群决策方法

针对属性值为区间灰数且专家权重未知、属性权重部分已知的不确定多属性群决策问题,提出了一种基于区间灰数的核和灰度的决策方法。给出了区间灰数的基于核和灰度的简化形式,充分利用区间灰数的核和灰度的信息建立优化模型求得属性的权重。在求出属性权重的基础上,运用灰色关联方法分别求取各专家的核与灰度距理想方案值的关联系数,综合两者得到专家权重,最终综合专家意见并对方案比较排序得出最优结果。鉴于此,提出一种基于区间灰数相对核与灰度的决策方法。最后以一个算例验证该方法的有效性和可行性。     

静态初始条件下的歼击机中距攻防引导方法决策

在静态初始条件下,歼击机中距攻防引导方法的选择是一个定性与定量相结合的类别划分问题,因此,将粗糙集理论与概率神经网络相结合用于该问题的解决。首先,利用粗糙集理论实现专家知识约简、空战态势信息集压缩,得到最小决策信息集;其次,利用概率神经网络进行概率决策推理;最后,通过实例分析,结果表明决策推理正确,在不确定环境下仍然有效,提高了决策过程的自动化程度。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015